Pellans sequence and its diophantine triples
نویسندگان
چکیده
منابع مشابه
Pellans Sequence and Its Diophantine Triples
We introduce a novel fourth order linear recurrence sequence {Sn} using the two periodic binary recurrence. We call it “pellans sequence” and then we solve the system ab+ 1 = Sx, ac + 1 = Sy bc+ 1 = Sz where a < b < c are positive integers. Therefore, we extend the order of recurrence sequence for this variant diophantine equations by means of pellans sequence.
متن کاملStrong Diophantine Triples
We prove that there exist infinitely many triples a, b, c of non-zero rationals with the property that a + 1, b + 1, c + 1, ab + 1, ac + 1 and bc + 1 are perfect squares.
متن کاملBalancing diophantine triples
In this paper, we show that there are no three distinct positive integers a, b and c such that ab + 1, ac + 1, bc + 1 all are balancing numbers.
متن کاملAn Interesting Diophantine Problem on Triples-I
We search for three non-zero distinct integers a, b, c such that, if a non-zero integer is added to the sum of any pair of them as well as to their sum, the results are all squares. Index Terms – Diophantine Problem, Integer Triple, System of Equations.
متن کاملBalancing Diophantine triples with distance 1
For a positive real number w let the Balancing distance ‖w‖B be the distance from w to the closest Balancing number. The Balancing sequence is defined by the initial values B0 = 0, B1 = 1 and by the binary recurrence relation Bn+2 = 6Bn+1 − Bn , n ≥ 0. In this paper, we show that there exist only one positive integer triple (a, b, c) such that the Balancing distances ‖ab‖B , ‖ac‖B and ‖bc‖B all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications de l'Institut Mathematique
سال: 2016
ISSN: 0350-1302,1820-7405
DOI: 10.2298/pim1614259i